What can be expected from a Boolean derivative?
نویسنده
چکیده
Several concepts of a Boolean derivative have been investigated in the literature. In this paper we find out whether a Boolean operator can satisfy all of the three basic derivative-like properties: additivity, homogeneity and the Leibniz rule. In a certain sense, the answer is negative. The attempts to establish Boolean analogues of several concepts and results from Calculus begun in 1917 with a paper by Daniell [6], which sketched a theory of convergence for sequences and series in a Boolean algebra. Some forty years later Reed [11], Huffman [9] and Akers Jr. [1] introduced (partial) derivatives of Boolean functions and pointed out their applicability to switching theory. Ever since then the theory of Boolean derivatives has developed tremendously, both in view of applications and for its own algebraic interest; see e.g. [3], [4], [5], [7], [10], [13], [15], [16], [17], [18], [19]. There are several Boolean analogues of the conventional concept of a derivative; of course, these Boolean derivatives share some, but not all of the properties of their conventional model. A paper by Bazsó and Lábos [2] states that a “good” concept of a derivative should be additive, i.e., (f + g) = f ′ + g, homogeneous, i.e., (kf) = kf , and should satisfy the Leibniz identity, i.e., (fg) = fg + gf . Bazsó and Lábos are concerned with algebras of Boolean functions. They remark that the well-known sensitivity function does not
منابع مشابه
Omega-almost Boolean rings
In this paper the concept of an $Omega$- Almost Boolean ring is introduced and illistrated how a sheaf of algebras can be constructed from an $Omega$- Almost Boolean ring over a locally Boolean space.
متن کاملDerivative Operations for Lattices of Boolean Functions
This paper explores derivative operations of the Boolean differential calculus for lattices of Boolean functions. Such operations are needed to design circuits with short delay and low power consumption [3] as well as to calculate minimal complete sets of fitting test patterns [4]. It will be shown that each derivative operation of a lattice of Boolean functions creates again a lattice of Boole...
متن کاملBoolean Differential Equations
The expressiveness of Boolean Algebras is significantly extended by the Boolean Differential Calculus (BDC). The additionally defined differentials of Boolean variables, differentials and further differential operators of Boolean functions as well as several derivative operations of Boolean functions allow to model changes of function values together with changes of the values of variables and ...
متن کاملUsing boolean and fuzzy logic combined with analytic hierarchy process for hazardous waste landfill site selection: A case study from Hormozgan province, Iran
Hazardous wastes include numerous kinds of discarded chemicals and other wastes generated from industrial, commercial, and institutional activities. These types of waste present immediate or long-term risks to humans, animals, plants, or the environment and therefore require special handling for safe disposal. Landfills that can accept hazardous wastes are excavated or engineered sites where th...
متن کاملON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009